Optimization Algorithm Simulation for Dual-Resource Constrained Job-Shop Scheduling
نویسندگان
چکیده
منابع مشابه
Adaptive Hybrid ant colony optimization for solving Dual Resource Constrained Job Shop Scheduling Problem
This paper presents a scheduling approach, based on Ant Colony Optimization (ACO), developed to address the scheduling problem in manufacturing systems constrained by both machines and heterogeneous workers called as Dual Resource Constrained Job Shop Scheduling Problem with Heterogeneous Workers. This hybrid algorithm utilizes the combination of ACO and Simulated Annealing (SA) algorithm and p...
متن کاملChapter 1 AN OPTIMIZATION - BASED ALGORITHM FOR JOB SHOP SCHEDULING
Scheduling is a key factor for manufacturing productivity. Effective scheduling can improve on-time delivery, reduce inventory, cut lead times, and improve the utilization of bottleneck resources. Because of the combinatorial nature of scheduling problems, it is often difficult to find optimal schedules, especially within a limited amount of computation time. Production schedules therefore are ...
متن کاملAn ant colony optimization algorithm for job shop scheduling problem
The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop S...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملA Genetic Algorithm for Job-Shop Scheduling
In this paper, we analyze the characteristics of the job shop scheduling problem. A new genetic algorithm for solving the agile job shop scheduling is presented to solve the job shop scheduling problem. Initial population is generated randomly. Two-row chromosome structure is adopted based on working procedure and machine distribution. The relevant crossover and mutation operation is also desig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Simulation Modelling
سال: 2018
ISSN: 1726-4529
DOI: 10.2507/ijsimm17(1)co2